On degree sets in k-partite graphs
نویسندگان
چکیده
منابع مشابه
Score Sets in Oriented k - partite Graphs
Let D(U1, U2, ..., Uk) be an oriented k -partite graph with |Ui| = ni, 1 ≤ i ≤ k. Then, the score of a vertex ui in Ui is defined by aui (or simply ai ) = ∑k t=1, t 6=i nt+d + ui −d − ui , where d+ui and d − ui are respectively the outdegree and indegree of ui. The set A of distinct scores of the vertices of D(U1, U2, ..., Uk) is called its score set. In this paper, we prove that if a1 is a non...
متن کاملThe median problem on k-partite graphs
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G. The median problem of graphs is closely related to the optimization problems involving the placement of network servers, the core of the entire networks. Bipart...
متن کاملOn finding k-cliques in k-partite graphs
In this paper, a branch-and-bound algorithm for finding all cliques of size k in a kpartite graph is proposed that improves upon the method of Grunert et al (2002). The new algorithm uses bit-vectors, or bitsets, as the main data structure in bit-parallel operations. Bitsets enable a new form of data representation that improves branching and backtracking of the branch-and-bound procedure. Nume...
متن کاملMinus domination number in k-partite graphs
A function f de1ned on the vertices of a graph G = (V; E); f :V → {−1; 0; 1} is a minus dominating function if the sum of its values over any closed neighborhood is at least one. The weight of a minus dominating function is f(V ) = ∑ v∈V f(v). The minus domination number of a graph G, denoted by −(G), equals the minimum weight of a minus dominating function of G. In this paper, a sharp lower bo...
متن کاملTotal minus domination in k-partite graphs
A function f defined on the vertices of a graph G = (V ,E), f : V → {−1, 0, 1} is a total minus dominating function (TMDF) if the sum of its values over any open neighborhood is at least one. The weight of a TMDF is the sum of its function values over all vertices. The total minus domination number, denoted by −t (G), of G is the minimum weight of a TMDF on G. In this paper, a sharp lower bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitatis Sapientiae, Informatica
سال: 2020
ISSN: 2066-7760
DOI: 10.2478/ausi-2020-0015